Small solutions to inhomogeneous linear equations over number fields

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving resultant form equations over number fields

We give an efficient algorithm for solving resultant form equations over number fields. This is the first time that such equations are completely solved by reducing them to unit equations in two variables.

متن کامل

On the Carlitz problem on the number of solutions to some special equations over finite fields

We consider an equation of the type a1x 2 1 + · · ·+ anxn = bx1 · · ·xn over the finite field Fq = Fps . Carlitz obtained formulas for the number of solutions to this equation when n = 3 and when n = 4 and q ≡ 3 (mod 4). In our earlier papers, we found formulas for the number of solutions when d = gcd(n − 2, (q − 1)/2) = 1 or 2 or 4; and when d > 1 and −1 is a power of p modulo 2d. In this pape...

متن کامل

All solutions to Thomas' family of Thue equations over imaginary quadratic number fields

We completely solve the family of relative Thue equations x − (t − 1)xy − (t + 2)xy − y = μ, where the parameter t, the root of unity μ and the solutions x and y are integers in the same imaginary quadratic number field. This is achieved using the hypergeometric method for |t| ≥ 53 and Baker’s method combined with a computer search using continued fractions for the remaining values of t.

متن کامل

The Distribution of Solutions to Equations over Finite Fields

Let F be the finite field in q = p1 elements, £(x) be a A:-tuple of polynomials in F [xx,..., x„], V be the set of points in ¥'j satisfying F(x) = 0 and S,T be any subsets of F;. Set y)= L e{— TrU '?)) íory±Q, and 4>(K) = maxv\ 02( V)q2k. In case q = p v/e deduce from this, for example,...

متن کامل

Counting Solutions to Equations in Many Variables over Finite Fields

We present a polynomial-time algorithm for computing the zeta function of a smooth projective hypersurface of degree d over a finite field of characteristic p, under the assumption that p is a suitably small odd prime and does not divide d. This improves significantly upon an earlier algorithm of the author and Wan which is only polynomial-time when the dimension is fixed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1993

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-1993-1094559-2